Facility location models for immobile servers with stochastic demand

This paper presents several models for the location of facilities subject to congestion. Motivated by applications to locating servers in communication networks and automatic teller machines in bank systems, these models are developed for situations in which immobile service facilities are congested by stochastic demand originating from nearby customer locations. We consider this problem from three different perspectives, that of (i) the service provider (wishing to limit costs of setup and operating servers), (ii) the customers (wishing to limit costs of accessing and waiting for service), and (iii) both the service provider and the customers combined. In all cases, a minimum level of service quality is ensured by imposing an upper bound on the server utilization rate at a service facility. The latter two perspectives also incorporate queueing delay costs as part of the objective. Some cases are amenable to an optimal solution. For those cases that are more challenging, we either propose heuristic procedures to find good solutions or establish equivalence to other well‐studied facility location problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Banach空间中严格拟伪压缩映像族公共不动点的迭代算法

根据Banach空间中严格拟伪压缩映像不动点的迭代格式,将其扩充到无穷多个严格拟伪压缩映像族公共不动点的迭代算法,证明其强收敛定理,扩展了已知的相关结果．     

Scheduling patients in an ambulatory surgical center

This paper presents a deterministic approach to schedule patients in an ambulatory surgical center (ASC) such that the number of postanesthesia care unit nurses at the center is minimized. We formulate the patient scheduling problem as new variants of the no‐wait, two‐stage process shop scheduling problem and present computational complexity results for the new scheduling models. Also, we develop a tabu search‐based heuristic algorithm to solve the patient scheduling problem. Our algorithm is shown to be very effective in finding near optimal schedules on a set of real data from a university hospital's ASC. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

水面舰艇防空作战能力的需求生成方法

为了更好地量化表达水面舰艇所具备的防空作战能力,提出了一种基于元活动的能力需求生成方法。建立了能力需求生成框架,在此框架下进行元活动库的提取,能力指标的分解,元活动-能力指标映射规则的分析得到中近程拦截能力的能力指标并进行了冲突消解,验证了所提方法的有效性。     

Crane scheduling with spatial constraints

In this work, we examine port crane scheduling with spatial and separation constraints. Although common to most port operations, these constraints have not been previously studied. We assume that cranes cannot cross, there is a minimum distance between cranes and jobs cannot be done simultaneously. The objective is to find a crane‐to‐job matching which maximizes throughput under these constraints. We provide dynamic programming algorithms, a probabilistic tabu search, and a squeaky wheel optimization heuristic for solution. Experiments show the heuristics perform well compared with optimal solutions obtained by CPLEX for small scale instances where a squeaky wheel optimization with local search approach gives good results within short times. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

关于强增生算子的有限族的强收敛定理

提出了Banach空间中非线性增生算子方程带误差的三重迭程式, 研究了多个非线性增生算子解与多个强伪压缩映象的公共不动点逼近问题, 获得 2个收敛定理。     

Maintenance and flight scheduling of low observable aircraft

In this article, we focus on relatively new maintenance and operational scheduling challenges that are faced by the United States Air Force concerning low‐observable (LO) or stealth aircraft. The LO capabilities of an aircraft degrade stochastically as it flies, making it difficult to make maintenance scheduling decisions. Maintainers can address these damages, but must decide, which aircraft should be put into maintenance, and for how long. Using data obtained from an active duty Air Force F‐22 wing and interviews with Air Force maintainers and program specialists, we model this problem as a generalization of the well‐known restless multiarmed bandit superprocess. Specifically, we use an extension of the traditional model to allow for actions that require varying lengths of time, and generate two separate index policies from a single model; one for maintenance actions and one for the flying action. These index policies allow maintenance schedulers to intuitively, quickly, and effectively rank a fleet of aircraft based on each aircraft's LO status and decide, which aircraft should enter into LO maintenance and for how long, and which aircraft should be used to satisfy daily sortie requirements. Finally, we present extensive data‐driven, detailed simulation results, where we compare the performance of the index policies against policies currently used by the Air Force, as well as some other possible more naive heuristics. The results indicate that the index policies significantly outperform existing policies in terms of fully mission capable (FMC) rates. In particular, the experiments highlight the importance of coordinated maintenance and flying decisions. © 2015 Wiley Periodicals, Inc. 62:60–80, 2015     

基于转移费用矩阵的机器人路径规划方法

本文描述了机器人路径规划的一种新方法：基于转移费用矩阵的机器人路径规划方法。通过定义转移费用矩阵的概念及其上的二元运算,将最优路径的生成,转化为矩阵的运算,使得有限步的矩阵运算,即可得到环境中所有点间的最优路径,达到了在预处理阶段构造最优路径集的目的。最后,介绍了该方法在移动机器人任务规划中的应用     

Machine scheduling with an availability constraint and job delivery coordination

In this paper we study the scheduling problem that considers both production and job delivery at the same time with machine availability considerations. Only one vehicle is available to deliver jobs in a fixed transportation time to a distribution center. The vehicle can load at most K jobs as a delivery batch in one shipment due to the vehicle capacity constraint. The objective is to minimize the arrival time of the last delivery batch to the distribution center. Since machines may not always be available over the production period in real life due to preventive maintenance, we incorporate machine availability into the models. Three scenarios of the problem are studied. For the problem in which the jobs are processed on a single machine and the jobs interrupted by the unavailable machine interval are resumable, we provide a polynomial algorithm to solve the problem optimally. For the problem in which the jobs are processed on a single machine and the interrupted jobs are nonresumable, we first show that the problem is NP‐hard. We then propose a heuristic with a worst‐case error bound of 1/2 and show that the bound is tight. For the problem in which the jobs are processed on either one of two parallel machines, where only one machine has an unavailable interval and the interrupted jobs are resumable, we propose a heuristic with a worst‐case error bound of 2/3. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

局部耗散型算子的Ishikawa迭代序列收敛性判别准则

给出了局部耗散型算子的Ishikawa迭代序列的收敛定理,将近期该领域的许多结果一般化。